翻訳と辞書 |
110-vertex Iofinova-Ivanov graph : ウィキペディア英語版 | 110-vertex Iofinova-Ivanov graph
The 110-vertex Iofinova-Ivanov graph is, in graph theory, a semi-symmetric cubic graph with 110 vertices and 165 edges. == Properties == Iofinova and Ivanov proved in 1985 the existence of five and only five semi-symmetric cubic bipartite graphs whose automorphism groups act primitively on each partition. The smallest has 110 vertices. The others have 126, 182, 506 and 990. The 126-vertex Iofinova-Ivanov graph is also known as the Tutte 12-cage. The diameter of the 110-vertex Iofinova-Ivanov graph, the greatest distance between any pair of vertices, is 7. Its radius is likewise 7. Its girth is 10. It is 3-connected and 3-edge-connected: to make it disconnected at least three edges, or at least three vertices, must be removed.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「110-vertex Iofinova-Ivanov graph」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|